Palindromic Richness

نویسندگان

  • Amy Glen
  • Jacques Justin
  • Steve Widmer
  • Luca Q. Zamboni
چکیده

In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are ‘rich’ in palindromes in the utmost sense. A characteristic property of so-called rich words is that all complete returns to any palindromic factor are themselves palindromes. These words encompass the well-known episturmian words, originally introduced by the second author together with X. Droubay and G. Pirillo in 2001. Other examples of rich words have appeared in many different contexts. Here we present the first unified approach to the study of this intriguing family of words. Amongst our main results, we give an explicit description of the periodic rich infinite words and show that the recurrent balanced rich infinite words coincide with the balanced episturmian words. We also consider two wider classes of infinite words, namely weakly rich words and almost rich words (both strictly contain all rich words, but neither one is contained in the other). In particular, we classify all recurrent balanced weakly rich words. As a consequence, we show that any such word on at least three letters is necessarily episturmian; hence weakly rich words obey Fraenkel’s conjecture. Likewise, we prove that a certain class of almost rich words obeys Fraenkel’s conjecture by showing that the recurrent balanced ones are episturmian or contain at least two distinct letters with the same frequency. Lastly, we study the action of morphisms on (almost) rich words with particular interest in morphisms that preserve (almost) richness. Such morphisms belong to the class of P morphisms that was introduced by A. Hof, O. Knill, and B. Simon in 1995.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Languages invariant under more symmetries: Overlapping factors versus palindromic richness

Factor complexity C and palindromic complexity P of infinite words with language closed under reversal are known to be related by the inequality P(n) + P(n + 1) ≤ 2 + C(n + 1) − C(n) for any n ∈ N . Word for which the equality is attained for any n is usually called rich in palindromes. In this article we study words whose languages are invariant under a finite group G of symmetries. For such w...

متن کامل

2 01 1 Generalized Thue - Morse words and palindromic richness

is valid for any infinite word u with language closed under reversal and for any n. Therefore, the fact that a word u is rich in palindromes expresses that u is saturated by palindromes up to the highest possible level. Arnoux-Rauzy words (among them Sturmian words) and words coding interval exchange transformation with the symmetric permutation belong to the most prominent examples of rich wor...

متن کامل

Constructions of words rich in palindromes and pseudopalindromes

First, we present an overview of results on words rich in palindromes and examples of rich words. We introduce G-richness, where G is a finite group generated by involutory antimorphisms over A∗. We study G-analogue of results known for the classical richness. Finally, we concentrate on the question how to construct G-rich words. We recall the notion of generalized palindromic closure which use...

متن کامل

Molecular Analysis of Shigella sonnei Strains Isolated from Hospitals of Tehran and Ilam Cities Using Repetitive Extragenic Palindromic Polymerase Chain Reaction (REP-PCR)

Background and Objective: Shigella species belong to the family Enterobacteriaceae, which cause dysentery with abdominal pain and tenesmus in human. Our country is one of the endemic and occasional epidemic areas of the disease. In the present study, Repetitive Extragenic Palindromic Polymerase Chain Reaction (REP-PCR) technique that has high differentiation and specificity power compared to ph...

متن کامل

Palindromic quadratization and structure-preserving algorithm for palindromic matrix polynomials of even degree

In this paper, we propose a palindromic quadratization approach, transforming a palindromic matrix polynomial of even degree to a palindromic quadratic pencil. Based on the (S + S−1)-transform and Patel’s algorithm, the structurepreserving algorithm can then be applied to solve the corresponding palindromic quadratic eigenvalue problem. Numerical experiments show that the relative residuals for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2009